Combinatorial analysis of the minimum distance of turbo codes

Combinatorial Analysis of the Minimum Distance of Turbo Codes

Revisiting the calculation of effective free distance of turbo codes

Introduction: Several authors [1, 2] have agreed that the performance of turbo codes [3] at the error floor region is largely determined by the weight-2 input minimum distance, which corresponds to the minimum Hamming weight among all codeword sequences generated by input sequences of weight two. If a turbo code T consists of N parallel concatenated convolutional codes separated by uniform inte...

Designing a Sensible Block Semi-Random Interleaver for Turbo Codes

It is highly known that an interleaver (a device that scrambles the order of a sequence of numbers) is a key component of a turbo encoder to guarantee excellent bit error rate and frame error rate performances. Turbo codes were initially proposed using a randomly constructed interleaver. Turbo codes are a rank of high-performance forward error correction (FEC) codes, which were the initial prac...

An approach to fault detection and correction in design of systems using of Turbo ‎codes‎

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...

Revisiting the Calculation of the Effective Free Distance of Turbo Codes

Introduction: Several authors [1, 2] have agreed that the performance of turbo codes [3] at the error floor region is largely determined by the weight-2 input minimum distance, which corresponds to the minimum Hamming weight among all codeword sequences generated by input sequences of weight two. If a turbo code T consists of N parallel concatenated convolutional codes separated by uniform inte...